The Density of Weakly Complete Problems under Adaptive Reductions
نویسندگان
چکیده
Given a real number every language that is weakly P n T hard for E or weakly P n T hard for E is shown to be exponentially dense This simultaneously strengthens results of Lutz and Mayordomo and Fu
منابع مشابه
Completeness and Weak Completeness Under Polynomial-Size Circuits
This paper investigates the distribution and nonuniform complexity of problems that are com plete or weakly complete for ESPACE under nonuniform reductions that are computed by polynomial size circuits P Poly Turing reductions and P Poly many one reductions A tight exponential lower bound on the space bounded Kolmogorov complexities of weakly P Poly Turing complete problems is established A Sma...
متن کاملComparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: 1. Adaptive reductions are more powerful than nonadaptive reductions: there is a problem that is Turing-complete for NP but not truth-table-complete. 2. Strong nondeterministic reductions are more powerful than deterministic reductions: there is a problem that is SNP-co...
متن کاملFixed point theorems under weakly contractive conditions via auxiliary functions in ordered $G$-metric spaces
We present some fixed point results for a single mapping and a pair of compatible mappings via auxiliary functions which satisfy a generalized weakly contractive condition in partially ordered complete $G$-metric spaces. Some examples are furnished to illustrate the useability of our main results. At the end, an application is presented to the study of exi...
متن کاملOn Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy collapses to the third level. Feigenbaum and Fortnow (SICOMP 22:994-1005, 1993) show the same conclusion under the stronger assumption that an NP-complete problem has a non-adaptive random self-reduction. Our result show...
متن کاملRandomized Reductions and Isomorphisms
Randomizing reductions have provided new techniques for tackling average-case complexity problems. For example, although some NP-complete problems with uniform distributions on instances cannot be complete under deterministic one-one reductions [WB95], they are complete under randomized reductions [VL88]. We study randomized reductions in this paper on reductions that are one-one and honest map...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 30 شماره
صفحات -
تاریخ انتشار 1997